On nondeterminism in parallel computation
نویسندگان
چکیده
منابع مشابه
Parallel computation framework for optimizing trailer routes in bulk transportation
We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...
متن کاملLower Bounds for Computation with Limited Nondeterminism
We investigate the e ect of limiting the number of available nondeterministic bits in di erent computational models. First we relate formula size to one-way communication complexity and derive lower bounds of (n = log n) on the size of formulae with n = log n nondeterministic bits for 0 < 1=2. Next we prove a rounds-communication hierarchy for communication complexity with limited nondeterminis...
متن کاملA Note on Nondeterminism in Small, Fast Parallel Computers
Nondeterministic analogues of the well-known classes NC and SC, d d NNC and NSC, respectively, are investigated. Adding nondeterminism to SC leaves it in the domain of parallel computation since NSC E POLYLOGSPACE. That is, NSC is a subset of the class of languages computable by fast parallel computers. Adding noodeterminism to NC appears to make it much more powerful since NNC = NP. It is clea...
متن کاملComputation Power of Randomization and Nondeterminism
The fundamental questions of computation theory are related to the relative power of determinism, nondeterminism, and randomization. The famous P vs. NP problem is not the only one of main interest. The class of practically solvable algorithmic problems is not specified by deterministic polynomial time (P) anymore, but by bounded-error polynomial time algorithms. Hence, the comparison of the ef...
متن کاملParallel Functional Computation on STAR:DUST
STAR:DUST (‘St. Andrews RISC: Dataflow Using Sequential Threads’) is a processor design optimized for efficient execution of sequential threads while supporting plug-and-play construction of large multiprocessor systems. Besides satisfying the major RISC criteria (small instruction set, simple instruction format, load/store principle, pipelining), STAR:DUST employs a dataflow approach to commun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1986
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90139-8